Performance Analysis of Concurrency Control Mechanisms for OLTP Databases

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Performance Concurrency Control Mechanisms for Main-Memory Databases

A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate r...

متن کامل

Performance of Multiversion and Distributed Two-Phase Locking Concurrency Control Mechanisms in Distributed Databases

Abstract In this paper we have presented a detailed simulation study of a distributed multiversion and a distributed two-phase locking concurrency control mechanisms. Our experiment concentrated on measuring the effect of message overhead, read:write ratios, data partitioning and partial replication on the performance of these mechanisms. The effect of these parameters has not been investigated...

متن کامل

Performance of Distributed Optimistic Concurrency Control in Real-Time Databases

Concurrency control is one of the main issues in the studies of real-time database systems. In this paper different distributed concurrency control methods are studied and evaluated in real-time system environment. Because optimistic concurrency control is promising candidate for real-time database systems, distributed optimistic concurrency control methods are discussed more detailed way. We p...

متن کامل

Speculative Concurrency Control for Real-Time Databases

In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to i...

متن کامل

Speculative Concurrency Control for Real-Time Databases

In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information and Education Technology

سال: 2014

ISSN: 2010-3689

DOI: 10.7763/ijiet.2014.v4.420